Relative Ockham lattices: their order-theoretic and algebraic characterisation
نویسندگان
چکیده
منابع مشابه
Algebraic Properties of Intuitionistic Fuzzy Residuated Lattices
In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...
متن کاملAlgebraic Specifications, Higher-Order Types, and Set-Theoretic Models
In most algebraic specification frameworks, the type system is restricted to sorts, subsorts, and first-order function types. This is in marked contrast to the so-called model-oriented frameworks, which provide higher-order types, interpreted set-theoretically as Cartesian products, function spaces, and power-sets. This paper presents a simple framework for algebraic specifications with higher-...
متن کاملAlgebraic Speciications, Higher-order Types, and Set-theoretic Models
In most algebraic speciication frameworks, the type system is restricted to sorts, subsorts, and rst-order function types. This is in marked contrast to the so-called model-oriented frameworks, which provide higher-order types, interpreted set-theoretically as Cartesian products , function spaces, and power-sets. This paper presents a simple framework for algebraic speciications with higher-ord...
متن کاملA new order-theoretic characterisation of the polytime computable functions☆
We propose a new order-theoretic characterisation of the class of polytime computable functions. To this avail we define the small polynomial path order ([Formula: see text] for short). This termination order entails a new syntactic method to analyse the innermost runtime complexity of term rewrite systems fully automatically: for any rewrite system compatible with [Formula: see text] that empl...
متن کاملAlgebraic Lattices
Let L be a non empty reflexive relational structure. The functor CompactSublatt(L) yields a strict full relational substructure of L and is defined as follows: (Def. 1) For every element x of L holds x ∈ the carrier of CompactSublatt(L) iff x is compact. Let L be a lower-bounded non empty reflexive antisymmetric relational structure. Observe that CompactSublatt(L) is non empty. Next we state th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 1990
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089500009058